Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Detecting community in bipartite network based on cluster analysis
ZHANG Qiangqiang, HUANG Tinglei, ZHANG Yinming
Journal of Computer Applications    2015, 35 (12): 3511-3514.   DOI: 10.11772/j.issn.1001-9081.2015.12.3511
Abstract610)      PDF (620KB)(420)       Save
Concerning the problems of the low accuracy of community detection in bipartite network and the strong dependence on additional parameters, depending on the original network topology, based on the idea of spectral clustering algorithm, a new community algorithm was proposed. The proposed algorithm mined community by mapping a bipartite network to a single network, substituted resource distribution matrix for traditional similarity matrix, effectively guaranteed the information of the original network, improved the input of spectral clustering algorithm and the accuracy of community detection. The modularity function was applied to clustering analysis, and the modularity was used to measure the quality of community mining, effectively solved the problem of automatically determining the clustering number. The experimental results on the actual network and artificial network show that, compared with ant colony optimization algorithm, edge clustering coefficient algorithm etc., the proposed algorithm can not only accurately identify the number of the communities of the bipartite network, but also obtain higher quality of community partitioning without previously known parameters. The proposed algorithm can be applied to the deep understanding of bipartite network, such as recommendation and influence analysis.
Reference | Related Articles | Metrics